81![c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754.
DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754.
DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation](https://www.pdfsearch.io/img/0607c29ae4d74156d20f5df03d003ca3.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2006-01-18 09:22:02
|
---|
82![CSE 584A Class 9 Jeremy Buhler February 17, 2016 1 CSE 584A Class 9 Jeremy Buhler February 17, 2016 1](https://www.pdfsearch.io/img/5ce94a6c9ba15faffed63f42704ae132.jpg) | Add to Reading ListSource URL: classes.engineering.wustl.eduLanguage: English - Date: 2016-02-17 07:34:28
|
---|
83![RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering](https://www.pdfsearch.io/img/89d4bd84d046621ee14c7796ca1b0f44.jpg) | Add to Reading ListSource URL: grk1855.tu-dortmund.deLanguage: English - Date: 2015-06-25 08:55:11
|
---|
84![Local Checkability, No Strings Attached Klaus-Tycho Förster, Thomas Lüdi, Jochen Seidel, Roger Wattenhofer Wednesday – December 09, 2015 @MIT: Theory of Distributed Systems Group ETH Zurich – Distributed Computing Local Checkability, No Strings Attached Klaus-Tycho Förster, Thomas Lüdi, Jochen Seidel, Roger Wattenhofer Wednesday – December 09, 2015 @MIT: Theory of Distributed Systems Group ETH Zurich – Distributed Computing](https://www.pdfsearch.io/img/e300f6be97cedf64def9744355c3fb2d.jpg) | Add to Reading ListSource URL: www.disco.ethz.chLanguage: English - Date: 2015-12-14 03:34:43
|
---|
85![On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness Ulrich Kohlenbach BRICSy On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness Ulrich Kohlenbach BRICSy](https://www.pdfsearch.io/img/2fd30bec073551d84727a5bcc418925c.jpg) | Add to Reading ListSource URL: www.mathematik.tu-darmstadt.deLanguage: English - Date: 2012-11-16 09:32:59
|
---|
86![Local Checkability, No Strings Attached Klaus-Tycho Förster, Thomas Lüdi, Jochen Seidel, Roger Wattenhofer January 06, 2016 @ ICDCNSingapore ETH Zurich – Distributed Computing – www.disco.ethz.ch Local Checkability, No Strings Attached Klaus-Tycho Förster, Thomas Lüdi, Jochen Seidel, Roger Wattenhofer January 06, 2016 @ ICDCNSingapore ETH Zurich – Distributed Computing – www.disco.ethz.ch](https://www.pdfsearch.io/img/6aa5ceff68b3836baed7f0bf8217671c.jpg) | Add to Reading ListSource URL: www.tik.ee.ethz.chLanguage: English - Date: 2016-01-06 03:53:49
|
---|
87![Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich](https://www.pdfsearch.io/img/b626a89715e989431ede208dbba71b06.jpg) | Add to Reading ListSource URL: www.internetsociety.orgLanguage: English - Date: 2016-02-22 10:06:03
|
---|
88![Complexity Classes and Theories for the Comparator Circuit Value Problem Stephen A. Cook1 , Dai Tri Man Lê1 , and Yuli Ye1 1 Department of Computer Science, University of Toronto Complexity Classes and Theories for the Comparator Circuit Value Problem Stephen A. Cook1 , Dai Tri Man Lê1 , and Yuli Ye1 1 Department of Computer Science, University of Toronto](https://www.pdfsearch.io/img/6bee9a299d351168d849f7574826041f.jpg) | Add to Reading ListSource URL: www.cs.utoronto.caLanguage: English - Date: 2011-09-12 09:19:42
|
---|
89![Games, geometry, and [ the computational complexity of ] finding equilibria Bernhard von Stengel Department of Mathematics London School of Economics Games, geometry, and [ the computational complexity of ] finding equilibria Bernhard von Stengel Department of Mathematics London School of Economics](https://www.pdfsearch.io/img/371c2b4c26017af7666906d401467374.jpg) | Add to Reading ListSource URL: www.maths.lse.ac.ukLanguage: English - Date: 2006-07-13 23:31:34
|
---|
90![On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´ On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´](https://www.pdfsearch.io/img/9edbc4a58e66881f73b8dc2c7669d89a.jpg) | Add to Reading ListSource URL: www.levreyzin.comLanguage: English - Date: 2016-01-18 21:47:16
|
---|